A Symbolic Programming Approach to the Rendezvous Search Problem

Abstract In this paper we solve the rendezvous problem on line with markers that can be dropped at chosen times when initial distance D between players is known. case of one marker, $$M_1$$ M 1 game, marker held by player II start game and, once and found I, indicates in which direction I must move. two markers, $$M_2$$ 2 each holds dropping may differ. There uncertainty regarding configuration, goal to minimize expected time call value (of game) denoted $$R_1$$ R $$R_2$$ for games respectively. We present an algorithm computes exactly as a function z , i.e. $$z\mapsto R_1(z)$$ z ↦ ( ) . Then show $$R_1(z)$$ locally affine compute parameters local representations Finally, $$R_1=min_z = m i n optimal determined expression The same proceeding extended apply Symbolic execution programs classical technique program testing computer science, see King [1] pioneering work. work adapt symbolic optimization problem. To our knowledge first attempted, particular deal problems.